@proceedings{.,
 title = {2008 9th International Conference on Web-Age Information Management (WAIM)}
}


@proceedings{.1998,
 year = {1998},
 title = {Photonics East (ISAM, VVDC, IEMB)},
 publisher = {SPIE},
 series = {SPIE Proceedings}
}


@book{.2000,
 year = {2000},
 title = {Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms},
 address = {New York and Philadelphia},
 publisher = {Association for Computing Machinery and Society for Industrial and Applied Mathematics},
 isbn = {0-89871-453-2}
}


@proceedings{.b,
 title = {2007 IEEE Symposium on Computational Intelligence and Data Mining}
}


@proceedings{.c,
 title = {the 2006 ACM symposium}
}


@proceedings{.d,
 title = {2010 IEEE 26th International Conference on Data Engineering (ICDE 2010)}
}


@proceedings{.e,
 title = {the 2009 EDBT/ICDT Workshops}
}


@proceedings{.f,
 title = {the 20th ACM international conference}
}


@proceedings{.g,
 title = {the twelfth international conference}
}


@proceedings{.h,
 title = {the twelfth international conference}
}


@book{Aho.2007,
 abstract = {{\dq}This new edition of the classic {\dq}Dragon{\dq} book has been completely revised to include the most recent developments to compiling. The book provides a thorough introduction to compiler design and continues to emphasize the applicability of compiler technology to a broad range of problems in software design and development. The first hall of the book is designed for use in an undergraduate compilers course while the second half can be used in a graduate course stressing code optimization.{\dq}--BOOK JACKET.},
 author = {Aho, Alfred V.},
 year = {2007},
 title = {Compilers: Principles, techniques, {\&} tools},
 address = {Boston},
 edition = {2nd ed},
 publisher = {Pearson/Addison Wesley},
 isbn = {0321486811}
}


@incollection{Akutsu.1994,
 author = {Akutsu, Tatsuya and Halld{\'o}rsson, Magn{\'u}s M.},
 title = {On the approximation of largest common subtrees and largest common point sets},
 pages = {405--413},
 volume = {834},
 publisher = {Springer Berlin Heidelberg},
 isbn = {978-3-540-58325-7},
 series = {Lecture notes in computer science},
 editor = {Goos, G. and Hartmanis, J. and Du, Ding-Zhu and Zhang, Xiang-Sun},
 booktitle = {Algorithms and Computation},
 year = {1994},
 address = {Berlin and Heidelberg},
 doi = {10.1007/3-540-58325-4_205}
}


@incollection{Alonso.1993,
 author = {Alonso, Laurent and Schott, Ren{\'e}},
 title = {On the tree inclusion problem},
 pages = {211--221},
 volume = {711},
 publisher = {Springer Berlin Heidelberg},
 isbn = {978-3-540-57182-7},
 series = {Lecture notes in computer science},
 editor = {Goos, G. and Hartmanis, J. and Borzyszkowski, Andrzej M. and Soko{\l}owski, Stefan},
 booktitle = {Mathematical Foundations of Computer Science 1993},
 year = {1993},
 address = {Berlin and Heidelberg},
 doi = {10.1007/3-540-57182-5_13}
}


@book{Amir.2001,
 author = {Amir, Amihoo},
 year = {2001},
 title = {Combinatorial pattern matching: 12th annual symposium, Jerusalem, Israel, July 1 - 4, 2001 ; proceedings},
 address = {Berlin [u.a.]},
 edition = {[Elektronische Ressource]},
 volume = {2089},
 publisher = {Springer},
 isbn = {3-540-42271-4},
 series = {Lecture notes in computer science},
 institution = {{Annual Symposium on Combinatorial Pattern Matching} and {CPM 2001}}
}


@book{Appel.2002,
 abstract = {This textbook describes all phases of a modern compiler, including current techniques in code generation and register allocation, for imperative, functional and object-oriented languages. In a concise and practical way the author describes the fundamentals of compilation and then moves on to advanced topics such as SSA form, loop scheduling, and optimization for cache-memory hierarchies. The new edition features a redesigned compiler project in Java, for a subset of Java itself, covering both front-end and back-end phases.},
 author = {Appel, Andrew W. and Palsberg, Jens},
 year = {2002},
 title = {Modern compiler implementation in Java},
 address = {Cambridge and UK and New York and NY and USA},
 edition = {2nd ed},
 publisher = {Cambridge University Press},
 isbn = {0-521-82060-X}
}


@article{Arora.1998,
 author = {Arora, Sanjeev and Lund, Carsten and Motwani, Rajeev and Sudan, Madhu and Szegedy, Mario},
 year = {1998},
 title = {Proof verification and the hardness of approximation problems},
 pages = {501--555},
 volume = {45},
 number = {3},
 issn = {00045411},
 journal = {Journal of the ACM},
 doi = {10.1145/278298.278306}
}


@book{BaezaYates.2003,
 year = {2003},
 title = {Combinatorial Pattern Matching},
 address = {Berlin and Heidelberg},
 publisher = {Springer Berlin Heidelberg},
 isbn = {978-3-540-40311-1},
 series = {Lecture notes in computer science},
 editor = {Baeza-Yates, Ricardo and Ch{\'a}vez, Edgar and Crochemore, Maxime},
 doi = {10.1007/3-540-44888-8}
}


@incollection{Bertsch.2013,
 author = {Bertsch, Eberhard and Nederhof, Mark-Jan and Schmitz, Sylvain},
 title = {On LR Parsing with Selective Delays},
 pages = {244--263},
 volume = {7791},
 publisher = {Springer Berlin Heidelberg},
 isbn = {978-3-642-37050-2},
 series = {Lecture notes in computer science},
 editor = {Hutchison, David and Kanade, Takeo and Kittler, Josef and Kleinberg, Jon M. and Mattern, Friedemann and Mitchell, John C. and Naor, Moni and Nierstrasz, Oscar and Pandu Rangan, C. and Steffen, Bernhard and Sudan, Madhu and Terzopoulos, Demetri and Tygar, Doug and Vardi, Moshe Y. and Weikum, Gerhard and Jhala, Ranjit and Bosschere, Koen},
 booktitle = {Compiler Construction},
 year = {2013},
 address = {Berlin and Heidelberg},
 doi = {10.1007/978-3-642-37051-9_13}
}


@book{Bilardi.1998,
 year = {1998},
 title = {Algorithms --- ESA' 98},
 address = {Berlin and Heidelberg},
 publisher = {Springer Berlin Heidelberg},
 isbn = {978-3-540-64848-2},
 series = {Lecture notes in computer science},
 editor = {Bilardi, Gianfranco and Italiano, Giuseppe F. and Pietracaprina, Andrea and Pucci, Geppino},
 doi = {10.1007/3-540-68530-8}
}


@article{Chawathe.1996,
 author = {Chawathe, Sudarshan S. and Rajaraman, Anand and Garcia-Molina, Hector and Widom, Jennifer},
 year = {1996},
 title = {Change detection in hierarchically structured information},
 pages = {493--504},
 volume = {25},
 number = {2},
 issn = {01635808},
 journal = {ACM SIGMOD Record},
 doi = {10.1145/235968.233366}
}


@article{Chawathe.1997,
 author = {Chawathe, Sudarshan S. and Garcia-Molina, Hector},
 year = {1997},
 title = {Meaningful change detection in structured data},
 pages = {26--37},
 volume = {26},
 number = {2},
 issn = {01635808},
 journal = {ACM SIGMOD Record},
 doi = {10.1145/253262.253266}
}


@article{Chen.1998,
 author = {Chen, Weimin},
 year = {1998},
 title = {More Efficient Algorithm for Ordered Tree Inclusion},
 pages = {370--385},
 volume = {26},
 number = {2},
 issn = {01966774},
 journal = {Journal of Algorithms},
 doi = {10.1006/jagm.1997.0899}
}


@article{Chen.2001,
 author = {Chen, Weimin},
 year = {2001},
 title = {New Algorithm for Ordered Tree-to-Tree Correction Problem},
 pages = {135--158},
 volume = {40},
 number = {2},
 issn = {01966774},
 journal = {Journal of Algorithms},
 doi = {10.1006/jagm.2001.1170}
}


@book{Cormen.op.2009,
 author = {Cormen, Thomas H.},
 year = {op. 2009},
 title = {Introduction to algorithms},
 address = {Cambridge and Masachusetts and London},
 edition = {3rd ed},
 publisher = {The MIT Press},
 isbn = {0262033844}
}


@inproceedings{Desai.,
 author = {Desai, Bipin C. and Li, Ming and Mani, Murali and Rundensteiner, Elke A.},
 title = {Efficiently loading and processing XML streams},
 pages = {59},
 booktitle = {the 2008 international symposium},
 doi = {10.1145/1451940.1451950}
}


@article{Dubiner.1994,
 author = {Dubiner, Moshe and Galil, Zvi and Magen, Edith},
 year = {1994},
 title = {Faster tree pattern matching},
 pages = {205--213},
 volume = {41},
 number = {2},
 issn = {00045411},
 journal = {Journal of the ACM},
 doi = {10.1145/174652.174653}
}


@article{Farach.1995,
 author = {Farach, M. and Thorup, M.},
 year = {1995},
 title = {Fast Comparison of Evolutionary Trees},
 pages = {29--37},
 volume = {123},
 number = {1},
 issn = {08905401},
 journal = {Information and Computation},
 doi = {10.1006/inco.1995.1155}
}


@book{Fekete.2008,
 author = {Fekete, Alan and Lin, Xuemin},
 year = {2008},
 title = {Proceedings of the Nineteenth Australasian Database Conference: ADC 2007 [i.e. 2008],  Wollongong, NSW, Australia, January 2008},
 address = {Sydney and N.S.W},
 volume = {v. 75},
 publisher = {Australian Computer Society in association with the ACM Digital Library},
 isbn = {978-1-920682-56-9},
 series = {Conferences in research and practice in information technology series}
}


@book{Garey.1979,
 author = {Garey, Michael R. and Johnson, David S.},
 year = {1979},
 title = {Computers and intractability: A guide to the theory of NP-completeness},
 address = {San Francisco},
 publisher = {W.H. Freeman},
 isbn = {0716710455},
 series = {Series of books in the mathematical sciences}
}


@book{Gianfranco.1998,
 author = {Gianfranco, Bilardi},
 year = {1998},
 title = {Algorithms - ESA '98: 6th annual European symposium, Venice, Italy, August 24-26, 1998. Proceedings},
 address = {Berlin},
 volume = {1461},
 publisher = {Springer},
 isbn = {3-540-64848-8},
 series = {Lecture notes in computer science}
}


@book{Goldwasser.1994,
 year = {1994},
 title = {Proceedings: November 20 - 22, 1994, Santa, Fe, New Mexico},
 address = {Los Alamitos and Calif. [u.a.]},
 publisher = {IEEE Computer Soc. Pr},
 isbn = {0-8186-6580-7},
 editor = {Goldwasser, Shaf}
}


@book{Goos.1993,
 year = {1993},
 title = {Mathematical Foundations of Computer Science 1993},
 address = {Berlin and Heidelberg},
 publisher = {Springer Berlin Heidelberg},
 isbn = {978-3-540-57182-7},
 series = {Lecture notes in computer science},
 editor = {Goos, G. and Hartmanis, J. and Borzyszkowski, Andrzej M. and Soko{\l}owski, Stefan},
 doi = {10.1007/3-540-57182-5}
}


@book{Goos.1994,
 year = {1994},
 title = {Algorithms and Computation},
 address = {Berlin and Heidelberg},
 publisher = {Springer Berlin Heidelberg},
 isbn = {978-3-540-58325-7},
 series = {Lecture notes in computer science},
 editor = {Goos, G. and Hartmanis, J. and Du, Ding-Zhu and Zhang, Xiang-Sun},
 doi = {10.1007/3-540-58325-4}
}


@book{Goos.1994b,
 year = {1994},
 title = {Combinatorial Pattern Matching},
 address = {Berlin and Heidelberg},
 publisher = {Springer Berlin Heidelberg},
 isbn = {978-3-540-58094-2},
 series = {Lecture notes in computer science},
 editor = {Goos, Gerhard and Hartmanis, Juris and Crochemore, Maxime and Gusfield, Dan},
 doi = {10.1007/3-540-58094-8}
}


@book{Goos.1996,
 year = {1996},
 title = {Combinatorial Pattern Matching},
 address = {Berlin and Heidelberg},
 publisher = {Springer Berlin Heidelberg},
 isbn = {978-3-540-61258-2},
 series = {Lecture notes in computer science},
 editor = {Goos, Gerhard and Hartmanis, Juris and Leeuwen, Jan and Hirschberg, Dan and Myers, Gene},
 doi = {10.1007/3-540-61258-0}
}


@book{Goos.1997,
 year = {1997},
 title = {Combinatorial Pattern Matching},
 address = {Berlin and Heidelberg},
 publisher = {Springer Berlin Heidelberg},
 isbn = {978-3-540-63220-7},
 series = {Lecture notes in computer science},
 editor = {Goos, Gerhard and Hartmanis, Juris and Leeuwen, Jan and Apostolico, Alberto and Hein, Jotun},
 doi = {10.1007/3-540-63220-4}
}


@article{Green.2004,
 author = {Green, Todd J. and Gupta, Ashish and Miklau, Gerome and Onizuka, Makoto and Suciu, Dan},
 year = {2004},
 title = {Processing XML streams with deterministic automata and stream indexes},
 pages = {752--788},
 volume = {29},
 number = {4},
 issn = {03625915},
 journal = {ACM Transactions on Database Systems},
 doi = {10.1145/1042046.1042051}
}


@book{Grumbach.2005,
 author = {Grumbach, Stephane and Sui, Liying and Vianu, Victor},
 year = {2005},
 title = {Advances in Computer Science - ASIAN 2005. Data Management on the Web},
 address = {[New York]},
 volume = {3818},
 publisher = {Springer-Verlag Berlin/Heidelberg},
 isbn = {3-540-30767-2},
 series = {Lecture notes in computer science}
}


@book{Grune.2000,
 author = {Grune, Dick},
 year = {2000},
 title = {Modern compiler design: Dick Grune ... [et al.]},
 address = {Chichester},
 publisher = {Wiley},
 isbn = {0471976970},
 series = {Worldwide series in computer science}
}


@article{Gupta.1998,
 author = {Gupta, A. and Nishimura, N.},
 year = {1998},
 title = {Finding Largest Subtrees and Smallest Supertrees},
 pages = {183--210},
 volume = {21},
 number = {2},
 issn = {0178-4617},
 journal = {Algorithmica},
 doi = {10.1007/PL00009212}
}


@book{Gusfield.1997,
 author = {Gusfield, Dan},
 year = {1997},
 title = {Algorithms on strings, trees, and sequences: Computer science and computational biology},
 address = {Cambridge [England] and New York},
 publisher = {Cambridge University Press},
 isbn = {0521585198}
}


@inproceedings{Haddad.,
 author = {Haddad, Hisham M. and Xing, Guangming and Malla, Chaitanya R. and Xia, Zhonghang and Venkata, Snigdha Dantala},
 title = {Computing edit distances between an XML document and a schema and its application in document classification},
 pages = {831},
 booktitle = {the 2006 ACM symposium},
 doi = {10.1145/1141277.1141467}
}


@article{Harel.1984,
 author = {Harel, Dov and Tarjan, Robert Endre},
 year = {1984},
 title = {Fast Algorithms for Finding Nearest Common Ancestors},
 pages = {338--355},
 volume = {13},
 number = {2},
 issn = {0097-5397},
 journal = {SIAM Journal on Computing},
 doi = {10.1137/0213024}
}


@article{Hoffmann.1982,
 author = {Hoffmann, Christoph M. and O'Donnell, Michael J.},
 year = {1982},
 title = {Pattern Matching in Trees},
 pages = {68--95},
 volume = {29},
 number = {1},
 issn = {00045411},
 journal = {Journal of the ACM},
 doi = {10.1145/322290.322295}
}


@inproceedings{Huai.,
 author = {Huai, Jinpeng and Chen, Robin and Hon, Hsiao-Wuen and Liu, Yunhao and Ma, Wei-Ying and Tomkins, Andrew and Zhang, Xiaodong and Wei, Mingzhu and Rundensteiner, Elke A. and Mani, Murali},
 title = {Utility-driven load shedding for xml stream processing},
 pages = {855},
 booktitle = {Proceeding of the 17th international conference},
 doi = {10.1145/1367497.1367613}
}


@book{Hutchison.2012,
 year = {2012},
 title = {Programming Languages},
 address = {Berlin and Heidelberg},
 publisher = {Springer Berlin Heidelberg},
 isbn = {978-3-642-33181-7},
 series = {Lecture notes in computer science},
 editor = {Hutchison, David and Kanade, Takeo and Kittler, Josef and Kleinberg, Jon M. and Mattern, Friedemann and Mitchell, John C. and Naor, Moni and Nierstrasz, Oscar and Pandu Rangan, C. and Steffen, Bernhard and Sudan, Madhu and Terzopoulos, Demetri and Tygar, Doug and Vardi, Moshe Y. and Weikum, Gerhard and Carvalho Junior, Francisco Heron and Barbosa, Luis Soares},
 doi = {10.1007/978-3-642-33182-4}
}


@book{Hutchison.2012b,
 year = {2012},
 title = {Programming Languages},
 address = {Berlin and Heidelberg},
 publisher = {Springer Berlin Heidelberg},
 isbn = {978-3-642-33181-7},
 series = {Lecture notes in computer science},
 editor = {Hutchison, David and Kanade, Takeo and Kittler, Josef and Kleinberg, Jon M. and Mattern, Friedemann and Mitchell, John C. and Naor, Moni and Nierstrasz, Oscar and Pandu Rangan, C. and Steffen, Bernhard and Sudan, Madhu and Terzopoulos, Demetri and Tygar, Doug and Vardi, Moshe Y. and Weikum, Gerhard and Carvalho Junior, Francisco Heron and Barbosa, Luis Soares},
 doi = {10.1007/978-3-642-33182-4}
}


@book{Hutchison.2013,
 year = {2013},
 title = {Compiler Construction},
 address = {Berlin and Heidelberg},
 publisher = {Springer Berlin Heidelberg},
 isbn = {978-3-642-37050-2},
 series = {Lecture notes in computer science},
 editor = {Hutchison, David and Kanade, Takeo and Kittler, Josef and Kleinberg, Jon M. and Mattern, Friedemann and Mitchell, John C. and Naor, Moni and Nierstrasz, Oscar and Pandu Rangan, C. and Steffen, Bernhard and Sudan, Madhu and Terzopoulos, Demetri and Tygar, Doug and Vardi, Moshe Y. and Weikum, Gerhard and Jhala, Ranjit and Bosschere, Koen},
 doi = {10.1007/978-3-642-37051-9}
}


@incollection{Jiang.1994,
 author = {Jiang, Tao and Wang, Lusheng and Zhang, Kaizhong},
 title = {Alignment of trees --- An alternative to tree edit},
 pages = {75--86},
 volume = {807},
 publisher = {Springer Berlin Heidelberg},
 isbn = {978-3-540-58094-2},
 series = {Lecture notes in computer science},
 editor = {Goos, Gerhard and Hartmanis, Juris and Crochemore, Maxime and Gusfield, Dan},
 booktitle = {Combinatorial Pattern Matching},
 year = {1994},
 address = {Berlin and Heidelberg},
 doi = {10.1007/3-540-58094-8_7}
}


@article{Kilpelainen.1995,
 author = {Kilpel{\"a}inen, Pekka and Mannila, Heikki},
 year = {1995},
 title = {Ordered and Unordered Tree Inclusion},
 pages = {340--356},
 volume = {24},
 number = {2},
 issn = {0097-5397},
 journal = {SIAM Journal on Computing},
 doi = {10.1137/S0097539791218202}
}


@article{Kim.2001,
 author = {Kim, Ik-Soon and Choe, Kwang-Moo},
 year = {2001},
 title = {Error repair with validation in LR-based parsing},
 pages = {451--471},
 volume = {23},
 number = {4},
 issn = {01640925},
 journal = {ACM Transactions on Programming Languages and Systems},
 doi = {10.1145/504083.504084}
}


@incollection{Klein.1998,
 author = {Klein, Philip N.},
 title = {Computing the Edit-Distance Between Unrooted Ordered Trees},
 pages = {91--102},
 volume = {1461},
 publisher = {Springer Berlin Heidelberg},
 isbn = {978-3-540-64848-2},
 series = {Lecture notes in computer science},
 editor = {Bilardi, Gianfranco and Italiano, Giuseppe F. and Pietracaprina, Andrea and Pucci, Geppino},
 booktitle = {Algorithms --- ESA' 98},
 year = {1998},
 address = {Berlin and Heidelberg},
 doi = {10.1007/3-540-68530-8_8}
}


@book{Knuth.1997,
 author = {Knuth, Donald E.},
 year = {1997},
 title = {The art of computer programming},
 address = {Reading and Mass},
 edition = {3. ed},
 volume = {/ Donald E. Knuth ; Vol. 1},
 publisher = {Addison-Wesley},
 isbn = {0201896834},
 series = {The art of computer programming}
}


@inproceedings{Kraft.,
 author = {Kraft, Donald and Frieder, Ophir and Hammer, Joachim and Qureshi, Sajda and Seligman, Len and Onizuka, Makoto},
 title = {Light-weight xPath processing of XML stream with deterministic automata},
 pages = {342},
 booktitle = {the twelfth international conference},
 doi = {10.1145/956863.956928}
}


@inproceedings{Kraft.b,
 author = {Kraft, Donald and Frieder, Ophir and Hammer, Joachim and Qureshi, Sajda and Seligman, Len and Su, Hong and Jian, Jinhui and Rundensteiner, Elke A.},
 title = {Raindrop},
 pages = {279},
 booktitle = {the twelfth international conference},
 doi = {10.1145/956863.956917}
}


@article{Kuhl.2000,
 author = {K{\"u}hl, Bernd and Schreiner, Axel-Toblas},
 year = {2000},
 title = {An object-oriented LL(1) parser generator},
 pages = {33--40},
 volume = {35},
 number = {12},
 issn = {03621340},
 journal = {ACM SIGPLAN Notices},
 doi = {10.1145/369928.369941}
}


@article{Landau.1989,
 author = {Landau, Gad M. and Vishkin, Uzi},
 year = {1989},
 title = {Fast parallel and serial approximate string matching},
 pages = {157--169},
 volume = {10},
 number = {2},
 issn = {01966774},
 journal = {Journal of Algorithms},
 doi = {10.1016/0196-6774(89)90010-2}
}


@article{Lenka.2006,
 author = {Lenka, Dillip Kumar and Kumar, Pawan},
 year = {2006},
 title = {States merging in LR parser},
 pages = {24},
 volume = {41},
 number = {4},
 issn = {03621340},
 journal = {ACM SIGPLAN Notices},
 doi = {10.1145/1147214.1147219}
}


@article{Lu.1984,
 abstract = {An algorithm that computes the best matching of two trees is described. The degree of mismatch, i.e., the distance, is measured in terms of the number of node splitting and merging operations required. The proposed tree distance is a more appropriate measurement of structural defonnation than the tree distance measure in terms of the number of insertions, deletions, and substitutions of tree nodes, as defined in previous studies. An algorithm that uses a divide-and-conquer strategy is presented. The analysis shows that the time complexity is O(NM2) where N and Al are the number of nodes of the two trees, respectively. The algorithm has been implemented on a VAX 11/780.},
 author = {Lu, S. Y.},
 year = {1984},
 title = {A tree-matching algorithm based on node splitting and merging},
 pages = {249--256},
 volume = {6},
 number = {2},
 issn = {0162-8828},
 journal = {IEEE transactions on pattern analysis and machine intelligence}
}


@incollection{Lu.2001,
 author = {Lu, Chin Lung and Su, Zheng-Yao and Tang, Chuan Yi},
 title = {A New Measure of Edit Distance between Labeled Trees},
 pages = {338--348},
 volume = {2108},
 publisher = {Springer Berlin Heidelberg},
 isbn = {978-3-540-42494-9},
 series = {Lecture notes in computer science},
 editor = {Wang, Jie},
 booktitle = {Computing and Combinatorics},
 year = {2001},
 address = {Berlin and Heidelberg},
 doi = {10.1007/3-540-44679-6_37}
}


@inproceedings{Manolescu.,
 author = {Manolescu, Ioana and Spaccapietra, Stefano and Teubner, Jens and Kitsuregawa, Masaru and Leger, Alain and Naumann, Felix and Ailamaki, Anastasia and Ozcan, Fatma and Onizuka, Makoto},
 title = {Processing XPath queries with forward and downward axes over XML streams},
 pages = {27},
 booktitle = {the 13th International Conference},
 doi = {10.1145/1739041.1739048}
}


@incollection{Medeiros.2012,
 author = {Medeiros, S{\'e}rgio and Mascarenhas, Fabio and Ierusalimschy, Roberto},
 title = {Left Recursion in Parsing Expression Grammars},
 pages = {27--41},
 volume = {7554},
 publisher = {Springer Berlin Heidelberg},
 isbn = {978-3-642-33181-7},
 series = {Lecture notes in computer science},
 editor = {Hutchison, David and Kanade, Takeo and Kittler, Josef and Kleinberg, Jon M. and Mattern, Friedemann and Mitchell, John C. and Naor, Moni and Nierstrasz, Oscar and Pandu Rangan, C. and Steffen, Bernhard and Sudan, Madhu and Terzopoulos, Demetri and Tygar, Doug and Vardi, Moshe Y. and Weikum, Gerhard and Carvalho Junior, Francisco Heron and Barbosa, Luis Soares},
 booktitle = {Programming Languages},
 year = {2012},
 address = {Berlin and Heidelberg},
 doi = {10.1007/978-3-642-33182-4_4}
}


@inproceedings{Mesiti.,
 author = {Mesiti, Marco and Truta, Traian Marius and Xiong, Li and M{\"u}ller, Sascha and Naacke, Hubert and Novikov, Boris and Raschia, Guillaume and Sanz, Ismael and Sens, Pierre and Shaporenkov, Dmitry and Travers, Nicolas and Dash, Ranjan and Fegaras, Leonidas},
 title = {Synopsis based load shedding in XML streams},
 pages = {93},
 booktitle = {the 2009 EDBT/ICDT Workshops},
 doi = {10.1145/1698790.1698806}
}


@incollection{Nishimura.1999,
 author = {Nishimura, Naomi and Ragde, Prabhakar and Thilikos, Dimitrios M.},
 title = {Finding Smallest Supertrees Under Minor Containment},
 pages = {303--312},
 volume = {1665},
 publisher = {Springer Berlin Heidelberg},
 isbn = {978-3-540-66731-5},
 series = {Lecture notes in computer science},
 editor = {Widmayer, Peter and Neyer, Gabriele and Eidenbenz, Stephan},
 booktitle = {Graph-Theoretic Concepts in Computer Science},
 year = {1999},
 address = {Berlin and Heidelberg},
 doi = {10.1007/3-540-46784-X_29}
}


@inproceedings{Ounis.,
 author = {Ounis, Iadh and Ruthven, Ian and Macdonald, Craig and Hummel, Felipe C. and da Silva, Altigran S. and Moro, Mirella M. and Laender, Alberto H. F.},
 title = {Multiple keyword-based queries over XML streams},
 pages = {1577},
 booktitle = {the 20th ACM international conference},
 doi = {10.1145/2063576.2063804}
}


@book{Papadimitriou.1989,
 author = {Papadimitriou, Christos H.},
 year = {1989},
 title = {30th annual symposium on foundations of computer science, October 30 - November 1, 1989, Research Trianlge Park, NC},
 address = {Los Alamitos and Calif. [etc.]},
 publisher = {IEEE Computer Society Press},
 isbn = {0-8186-1982-1},
 institution = {{Symposium on Foundations of Computer Science}}
}


@book{Parent.Oct.2007,
 abstract = {Annotation},
 author = {Parent, Christine},
 year = {Oct. 2007},
 title = {Conceptual Modeling - Er 2007},
 address = {New York},
 publisher = {Springer},
 isbn = {3-540-75562-4},
 series = {Lecture Notes in Computer Science / Information Systems and Applications, incl. Internet/Web, and HCI Ser}
}


@article{Pennello.2004,
 author = {Pennello, Thomas J. and DeRemer, Frank},
 year = {2004},
 title = {Efficient computation of LALR(1) look-ahead sets},
 pages = {14},
 volume = {39},
 number = {4},
 issn = {03621340},
 journal = {ACM SIGPLAN Notices},
 doi = {10.1145/989393.989396}
}


@article{PhilipBille.2005,
 author = {{Philip Bille}},
 year = {2005},
 title = {A survey on tree edit distance and related problems},
 pages = {217--239},
 volume = {337},
 number = {1-3},
 journal = {Theor. Comput. Sci.}
}


@article{Ramesh.1992,
 author = {Ramesh, R. and Ramakrishnan, I. V.},
 year = {1992},
 title = {Nonlinear pattern matching in trees},
 pages = {295--316},
 volume = {39},
 number = {2},
 issn = {00045411},
 journal = {Journal of the ACM},
 doi = {10.1145/128749.128752}
}


@incollection{Richter.1997,
 author = {Richter, Thorsten},
 title = {A new algorithm for the ordered tree inclusion problem},
 pages = {150--166},
 volume = {1264},
 publisher = {Springer Berlin Heidelberg},
 isbn = {978-3-540-63220-7},
 series = {Lecture notes in computer science},
 editor = {Goos, Gerhard and Hartmanis, Juris and Leeuwen, Jan and Apostolico, Alberto and Hein, Jotun},
 booktitle = {Combinatorial Pattern Matching},
 year = {1997},
 address = {Berlin and Heidelberg},
 doi = {10.1007/3-540-63220-4_57}
}


@incollection{SantosReis.2012,
 author = {Santos Reis, Leonardo Vieira and Silva Bigonha, Roberto and Iorio, Vladimir Oliveira and Souza Amorim, Luis Eduardo},
 title = {Adaptable Parsing Expression Grammars},
 pages = {72--86},
 volume = {7554},
 publisher = {Springer Berlin Heidelberg},
 isbn = {978-3-642-33181-7},
 series = {Lecture notes in computer science},
 editor = {Hutchison, David and Kanade, Takeo and Kittler, Josef and Kleinberg, Jon M. and Mattern, Friedemann and Mitchell, John C. and Naor, Moni and Nierstrasz, Oscar and Pandu Rangan, C. and Steffen, Bernhard and Sudan, Madhu and Terzopoulos, Demetri and Tygar, Doug and Vardi, Moshe Y. and Weikum, Gerhard and Carvalho Junior, Francisco Heron and Barbosa, Luis Soares},
 booktitle = {Programming Languages},
 year = {2012},
 address = {Berlin and Heidelberg},
 doi = {10.1007/978-3-642-33182-4_7}
}


@article{Scott.2006,
 author = {Scott, Elizabeth and Johnstone, Adrian},
 year = {2006},
 title = {Right nulled GLR parsers},
 pages = {577--618},
 volume = {28},
 number = {4},
 issn = {01640925},
 journal = {ACM Transactions on Programming Languages and Systems},
 doi = {10.1145/1146809.1146810}
}


@article{Shasha.1990,
 author = {Shasha, Dennis and Zhang, Kaizhong},
 year = {1990},
 title = {Fast algorithms for the unit cost editing distance between trees},
 pages = {581--621},
 volume = {11},
 number = {4},
 issn = {01966774},
 journal = {Journal of Algorithms},
 doi = {10.1016/0196-6774(90)90011-3}
}


@article{Simonian.1975,
 abstract = {Optical and ESR spectra of erythrocyte superoxide dismutase denaturated with acid and alkali are described. Sharp changes in activity and spectra were found. {\dq}Residual{\dq} activity of alkaline denaturated protein was higher than of acidic denaturated sample. It is suggested that covalent bonding copper-nitrogen is essential for superoxide dismutase activity of the protein or synthetic copper complexes.},
 author = {Simonian, M. A. and Nalbandian, R. M.},
 year = {1975},
 title = {Kislotnaia i shchelochnaia denaturatsiia superoksiddismutazy},
 pages = {783--787},
 volume = {20},
 number = {5},
 issn = {0006-3029},
 journal = {Biofizika}
}


@article{Sorkin.2011,
 author = {Sorkin, Arthur and Donovan, Peter},
 year = {2011},
 title = {LR(1) parser generation system},
 pages = {1},
 volume = {36},
 number = {2},
 issn = {01635948},
 journal = {ACM SIGSOFT Software Engineering Notes},
 doi = {10.1145/1943371.1943391}
}


@article{Sperber.2000,
 author = {Sperber, Michael and Thiemann, Peter},
 year = {2000},
 title = {Generation of LR parsers by partial evaluation},
 pages = {224--264},
 volume = {22},
 number = {2},
 issn = {01640925},
 journal = {ACM Transactions on Programming Languages and Systems},
 doi = {10.1145/349214.349219}
}


@article{Tai.1979,
 author = {Tai, Kuo-Chung},
 year = {1979},
 title = {The Tree-to-Tree Correction Problem},
 pages = {422--433},
 volume = {26},
 number = {3},
 issn = {00045411},
 journal = {Journal of the ACM},
 doi = {10.1145/322139.322143}
}


@article{TANAKA.1988,
 author = {TANAKA, EIICHI and TANAKA, KEIKO},
 year = {1988},
 title = {THE TREE-TO-TREE EDITING PROBLEM},
 pages = {221--240},
 volume = {02},
 number = {02},
 issn = {0218-0014},
 journal = {International Journal of Pattern Recognition and Artificial Intelligence},
 doi = {10.1142/S0218001488000157}
}


@article{Taylor.2002,
 author = {Taylor, R. Gregory},
 year = {2002},
 title = {LL parsing, LR parsing, complexity, and automata},
 pages = {71},
 volume = {34},
 number = {4},
 issn = {00978418},
 journal = {ACM SIGCSE Bulletin},
 doi = {10.1145/820127.820170}
}


@inproceedings{Tirthapura.1998,
 author = {Tirthapura, Srikanta and Sharvit, Daniel and Klein, Philip and Kimia, Benjamin B. and Kuo, C. -C Jay and Chang, Shih-Fu and Panchanathan, Sethuraman},
 title = {<title>Indexing based on edit-distance matching of shape graphs</title>},
 pages = {25--36},
 publisher = {SPIE},
 series = {SPIE Proceedings},
 booktitle = {Photonics East (ISAM, VVDC, IEMB)},
 year = {1998},
 doi = {10.1117/12.325825}
}


@article{TsongLiWang.1994,
 author = {Tsong-Li Wang, J. and {Kaizhong Zhang} and Jeong, K. and Shasha, D.},
 year = {1994},
 title = {A system for approximate tree matching},
 pages = {559--571},
 volume = {6},
 number = {4},
 issn = {10414347},
 journal = {IEEE Transactions on Knowledge and Data Engineering},
 doi = {10.1109/69.298173}
}


@article{Ukkonen.1985,
 author = {Ukkonen, Esko},
 year = {1985},
 title = {Finding approximate patterns in strings},
 pages = {132--137},
 volume = {6},
 number = {1},
 issn = {01966774},
 journal = {Journal of Algorithms},
 doi = {10.1016/0196-6774(85)90023-9}
}


@article{Ullman.1976,
 author = {Ullman, J. D. and Aho, A. V. and Hirschberg, D. S.},
 year = {1976},
 title = {Bounds on the Complexity of the Longest Common Subsequence Problem},
 pages = {1--12},
 volume = {23},
 number = {1},
 issn = {00045411},
 journal = {Journal of the ACM},
 doi = {10.1145/321921.321922}
}


@incollection{Valiente.2003,
 author = {Valiente, Gabriel},
 title = {Constrained Tree Inclusion},
 pages = {361--371},
 volume = {2676},
 publisher = {Springer Berlin Heidelberg},
 isbn = {978-3-540-40311-1},
 series = {Lecture notes in computer science},
 editor = {Baeza-Yates, Ricardo and Ch{\'a}vez, Edgar and Crochemore, Maxime},
 booktitle = {Combinatorial Pattern Matching},
 year = {2003},
 address = {Berlin and Heidelberg},
 doi = {10.1007/3-540-44888-8_26}
}


@article{Wagner.1974,
 author = {Wagner, Robert A. and Fischer, Michael J.},
 year = {1974},
 title = {The String-to-String Correction Problem},
 pages = {168--173},
 volume = {21},
 number = {1},
 issn = {00045411},
 journal = {Journal of the ACM},
 doi = {10.1145/321796.321811}
}


@book{Wang.2001,
 year = {2001},
 title = {Computing and Combinatorics},
 address = {Berlin and Heidelberg},
 publisher = {Springer Berlin Heidelberg},
 isbn = {978-3-540-42494-9},
 series = {Lecture notes in computer science},
 editor = {Wang, Jie},
 doi = {10.1007/3-540-44679-6}
}


@book{Waterman.1995,
 author = {Waterman, Michael S.},
 year = {1995},
 title = {Introduction to computational biology: Maps, sequences, and genomes : interdisciplinary statistics},
 address = {Boca Raton and Fla},
 edition = {1st ed},
 publisher = {Chapman {\&} Hall/CRC},
 isbn = {0412993910}
}


@book{Widmayer.1999,
 year = {1999},
 title = {Graph-Theoretic Concepts in Computer Science},
 address = {Berlin and Heidelberg},
 publisher = {Springer Berlin Heidelberg},
 isbn = {978-3-540-66731-5},
 series = {Lecture notes in computer science},
 editor = {Widmayer, Peter and Neyer, Gabriele and Eidenbenz, Stephan},
 doi = {10.1007/3-540-46784-X}
}


@article{Wu.2010,
 author = {Wu, Xiaoying and Theodoratos, Dimitri and Zuzarte, Calisto},
 year = {2010},
 title = {Efficient evaluation of generalized tree-pattern queries on XML streams},
 pages = {661--686},
 volume = {19},
 number = {5},
 issn = {1066-8888},
 journal = {The VLDB Journal},
 doi = {10.1007/s00778-010-0184-8}
}


@article{Zhang.1989,
 author = {Zhang, Kaizhong and Shasha, Dennis},
 year = {1989},
 title = {Simple Fast Algorithms for the Editing Distance between Trees and Related Problems},
 pages = {1245--1262},
 volume = {18},
 number = {6},
 issn = {0097-5397},
 journal = {SIAM Journal on Computing},
 doi = {10.1137/0218082}
}


@article{Zhang.1992,
 author = {Zhang, Kaizhong and Statman, Rick and Shasha, Dennis},
 year = {1992},
 title = {On the editing distance between unordered labeled trees},
 pages = {133--139},
 volume = {42},
 number = {3},
 issn = {00200190},
 journal = {Information Processing Letters},
 doi = {10.1016/0020-0190(92)90136-J}
}


@article{Zhang.1994,
 author = {Zhang, Kaizhong and Jiang, Tao},
 year = {1994},
 title = {Some MAX SNP-hard results concerning unordered labeled trees},
 pages = {249--254},
 volume = {49},
 number = {5},
 issn = {00200190},
 journal = {Information Processing Letters},
 doi = {10.1016/0020-0190(94)90062-0}
}


@article{Zhang.1996,
 author = {Zhang, Kaizhong},
 year = {1996},
 title = {A constrained edit distance between unordered labeled trees},
 pages = {205--222},
 volume = {15},
 number = {3},
 issn = {0178-4617},
 journal = {Algorithmica},
 doi = {10.1007/BF01975866}
}


@incollection{Zhang.1996b,
 author = {Zhang, Kaizhong},
 title = {Efficient parallel algorithms for tree editing problems},
 pages = {361--372},
 volume = {1075},
 publisher = {Springer Berlin Heidelberg},
 isbn = {978-3-540-61258-2},
 series = {Lecture notes in computer science},
 editor = {Goos, Gerhard and Hartmanis, Juris and Leeuwen, Jan and Hirschberg, Dan and Myers, Gene},
 booktitle = {Combinatorial Pattern Matching},
 year = {1996},
 address = {Berlin and Heidelberg},
 doi = {10.1007/3-540-61258-0_26}
}


@article{Cleary.2002,
 author = {Cleary, Sean},
 year = {2002},
 title = {Restricted rotation distance between binary trees},
 pages = {333--338},
 volume = {84},
 number = {6},
 issn = {00200190},
 journal = {Information Processing Letters},
 doi = {10.1016/S0020-0190(02)00315-0}
}


@article{Dehornoy.2010,
 author = {Dehornoy, Patrick},
 year = {2010},
 title = {On the rotation distance between binary trees},
 pages = {1316--1355},
 volume = {223},
 number = {4},
 issn = {00018708},
 journal = {Advances in Mathematics},
 doi = {10.1016/j.aim.2009.09.016}
}


@inproceedings{Bouchachia.,
 author = {Bouchachia, Abdelhamid and Hassler, Marcus},
 title = {Classification of XML Documents},
 pages = {390--396},
 booktitle = {2007 IEEE Symposium on Computational Intelligence and Data Mining},
 doi = {10.1109/CIDM.2007.368901}
}


@inproceedings{Cheng.,
 author = {Cheng, Huang and Jun, Li and Rougemont, Michel de},
 title = {Approximate Validity of XML Streaming Data},
 pages = {149--156},
 booktitle = {2008 9th International Conference on Web-Age Information Management (WAIM)},
 doi = {10.1109/WAIM.2008.97}
}


@article{Garofalakis.2005,
 author = {Garofalakis, Minos and Kumar, Amit},
 year = {2005},
 title = {XML stream processing using tree-edit distance embeddings},
 pages = {279--332},
 volume = {30},
 number = {1},
 issn = {03625915},
 journal = {ACM Transactions on Database Systems},
 doi = {10.1145/1061318.1061326}
}


@book{Hutchison.2012c,
 year = {2012},
 title = {Web-Age Information Management},
 address = {Berlin and Heidelberg},
 publisher = {Springer Berlin Heidelberg},
 isbn = {978-3-642-33049-0},
 series = {Lecture notes in computer science},
 editor = {Hutchison, David and Kanade, Takeo and Kittler, Josef and Kleinberg, Jon M. and Mattern, Friedemann and Mitchell, John C. and Naor, Moni and Nierstrasz, Oscar and Pandu Rangan, C. and Steffen, Bernhard and Sudan, Madhu and Terzopoulos, Demetri and Tygar, Doug and Vardi, Moshe Y. and Weikum, Gerhard and Bao, Zhifeng and Gao, Yunjun and Gu, Yu and Guo, Longjiang and Li, Yingshu and Lu, Jiaheng and Ren, Zujie and Wang, Chaokun and Zhang, Xiao},
 doi = {10.1007/978-3-642-33050-6}
}


@book{Jia.2008,
 author = {Jia, Yan and Meng, Weiyi and Jing, Ning},
 year = {2008},
 title = {The Ninth International Conference on Web-Age Information Management: WAIM 2008},
 address = {[Piscataway and N.J.]},
 publisher = {IEEE},
 isbn = {978-0-7695-3185-4}
}


@incollection{Wang.2012,
 author = {Wang, Songlin and Hong, Yihong and Yang, Jianwu},
 title = {XML Document Classification Using Closed Frequent Subtree},
 pages = {350--359},
 volume = {7419},
 publisher = {Springer Berlin Heidelberg},
 isbn = {978-3-642-33049-0},
 series = {Lecture notes in computer science},
 editor = {Hutchison, David and Kanade, Takeo and Kittler, Josef and Kleinberg, Jon M. and Mattern, Friedemann and Mitchell, John C. and Naor, Moni and Nierstrasz, Oscar and Pandu Rangan, C. and Steffen, Bernhard and Sudan, Madhu and Terzopoulos, Demetri and Tygar, Doug and Vardi, Moshe Y. and Weikum, Gerhard and Bao, Zhifeng and Gao, Yunjun and Gu, Yu and Guo, Longjiang and Li, Yingshu and Lu, Jiaheng and Ren, Zujie and Wang, Chaokun and Zhang, Xiao},
 booktitle = {Web-Age Information Management},
 year = {2012},
 address = {Berlin and Heidelberg},
 doi = {10.1007/978-3-642-33050-6_34}
}


@proceedings{.1620Aug.1998,
 year = {16-20 Aug. 1998},
 title = {Fourteenth International Conference on Pattern Recognition}
}


@inproceedings{Gavrila.,
 author = {Gavrila, D.M.},
 title = {Multi-feature hierarchical template matching using distance transforms},
 pages = {439--444},
 booktitle = {Fourteenth International Conference on Pattern Recognition},
 year = {16-20 Aug. 1998},
 doi = {10.1109/ICPR.1998.711175}
}


@article{YanhongZhai.2006,
 author = {{Yanhong Zhai} and {Bing Liu}},
 year = {2006},
 title = {Structured Data Extraction from the Web Based on Partial Tree Alignment},
 pages = {1614--1628},
 volume = {18},
 number = {12},
 issn = {10414347},
 journal = {IEEE Transactions on Knowledge and Data Engineering},
 doi = {10.1109/TKDE.2006.197}
}


@proceedings{.2012,
 year = {2012},
 title = {Computer Science and Information Systems (FedCSIS), 2012 Federated Conference on}
}


@inproceedings{Alabbas.2012,
 author = {Alabbas, M. and Ramsay, A.},
 title = {Dependency tree matching with extended Tree edit distance with subtrees for textual entailment},
 keywords = {natural language processing;pattern matching;tree data structures;NLP;TED;dependency tree matching;extended tree edit distance;semantic trees;subtree transformation operations;syntactic trees;textual entailment;Computer science;Educational institutions;Natural language processing;Pragmatics;Standards;Transforms;Vegetation},
 pages = {11--18},
 booktitle = {Computer Science and Information Systems (FedCSIS), 2012 Federated Conference on},
 year = {2012}
}


@inproceedings{Augsten.,
 author = {Augsten, Nikolaus and Barbosa, Denilson and Bohlen, Michael and Palpanas, Themis},
 title = {TASM: Top-k Approximate Subtree Matching},
 pages = {353--364},
 booktitle = {2010 IEEE 26th International Conference on Data Engineering (ICDE 2010)},
 doi = {10.1109/ICDE.2010.5447905}
}


@article{Vajnovszki.1998,
 author = {Vajnovszki, Vincent},
 year = {1998},
 title = {On the loopless generation of binary tree sequences},
 pages = {113--117},
 volume = {68},
 number = {3},
 issn = {00200190},
 journal = {Information Processing Letters},
 doi = {10.1016/S0020-0190(98)00155-0}
}


@article{Zerling.1985,
 author = {Zerling, David},
 year = {1985},
 title = {Generating binary trees using rotations},
 pages = {694--701},
 volume = {32},
 number = {3},
 issn = {00045411},
 journal = {Journal of the ACM},
 doi = {10.1145/3828.214141}
}

@article{Letunic.01012007,
author = {Letunic, Ivica and Bork, Peer}, 
year = {2007}, 
title = {Interactive Tree Of Life (iTOL): an online tool for phylogenetic tree display and annotation},
volume = {23}, 
number = {1}, 
pages = {127-128}, 
doi = {10.1093/bioinformatics/btl529},
URL = {http://bioinformatics.oxfordjournals.org/content/23/1/127.abstract}, 
eprint = {http://bioinformatics.oxfordjournals.org/content/23/1/127.full.pdf+html}, 
journal = {Bioinformatics} 
}


